Generic replica symmetric field-theory for short range Ising spin glasses

Symmetry considerations and a direct, Hubbard-Stratonovich type, derivation are used to construct a replica field-theory relevant to the study of the spin glass transition of short range models in a magnetic field. A mean-field treatment reveals that two different types of transitions exist, whenever the replica number n is kept larger than zero. The Sherrington-Kirkpatrick critical point in zero magnetic field between the paramagnet and replica magnet (a replica symmetric phase with a nonzero spin glass order parameter) separates from the de Almeida-Thouless line, along which replica symmetry breaking occurs. We argue that for studying the de Almeida-Thouless transition around the upper critical dimension d = 6, it is necessary to use the generic cubic model with all the three bare masses and eight cubic couplings. The critical role n may play is also emphasized. To make perturbative calculations feasible, a new representation of the cubic interaction is introduced. To illustrate the method, we compute the masses in one-loop order. Some technical details and a list of vertex rules are presented to help future renormalisation-group calculations. Received 9 October 2001     

Diode-pumped 671 nm laser frequency doubled by CPM LBO

A design of diode-pumped high-efficiency Nd:YVO₄/LBO red laser is reported. Using critical phase-matching (CPM) LBO, 671 nm red laser was obtained from 1342 nm light by intracavity frequency doubling. With an incident pump laser of 800 mW, using type-I and type-II CPM LBO, 97 and 52 mWTEM₀₀ mode red laser outputs were obtained, with optical-to-optical conversion efficiencies of up to 12.1% and 6.5%, respectively.     

Critical Point Theorems and Applications to Differential Equations

This paper contains a generalization of the well-known Palais-Smale and Cerami compactness conditions. The compactness condition introduced is used to prove some general existence theorems for critical points. Some applications are given to differential equations.     

Pseudo-Strong Regularity Around a Set

A generalization of strong regularity around a vertex subset C of a graph Γ, which makes sense even if Γis non-regular, is studied. Such a structure appears, together with a kind of distance-regularity around C , when an spectral bound concerning the so-called predistance polynomial of C is attained. As a main consequence of these results, it is shown that a regular (connected) graph Γwith d + 1 distinct eigenvalues is distance-regular, and its distance- d graph Γ d is strongly regular with parameters a = c , if and only if the number of vertices at distance d from each vertex satisfies an expression which depends only on the order of Γand the different eigenvalues of Γ.     

Drawing c-planar biconnected clustered graphs

In a graph, a cluster is a set of vertices, and two clusters are said to be non-intersecting if they are disjoint or one of them is contained in the other. A clustered graph C consists of a graph G and a set of non-intersecting clusters. In this paper, we assume that C has a compound planar drawing and each cluster induces a biconnected subgraph. Then we show that such a clustered graph admits a drawing in the plane such that (i) edges are drawn as straight-line segments with no edge crossing and (ii) the boundary of the biconnected subgraph induced by each cluster is a convex polygon.     

Effect of core-shell micelle formation on the redox properties of phenothiazine-labeled poly(ethyl glycidy ether)-block-poly(ethylene oxide)

Redox properties of phenothiazine-labeled poly(ethyl glycidy ether)-block-poly(ethylene oxide) (PT-EGE_n-b-EO_m) are reversibly changed by core-shell micelle formation. In the temperature range higher than the critical micellization temperature (cmt), the anodic potential of PT group positively shifts and concomitantly its anodic current decrease, or levels off compared to those of the reference polymer PT-EO_m without the thermo-responsive EGE_n segment. The former alteration is caused by incorporation of hydrophobic PT groups into a core of the micelle and the latter by the decrease in the diffusion coefficient of PT groups due to formation of the core-shell micelles. The cmt value and the temperature-dependent alteration in the redox properties strongly depend on the polymer structure, especially the length of thermo-responsive EGE_n segment. The electrochemically determined hydrodynamic radii of the polymer aggregates seem to be overestimated, compared to the values reported for the aggregates of other thermo-responsive polymers with similar molecular weights, implying the presence of electrochemically inactive PT groups in the copolymers having longer thermo-responsive segments.     

The node-edge weighted 2-edge connected subgraph problem: Linear relaxation, facets and separation

Let G=(V,E) be a undirected k-edge connected graph with weights c_e on edges and w_v on nodes. The minimum 2-edge connected subgraph problem, 2ECSP for short, is to find a 2-edge connected subgraph of G, of minimum total weight. The 2ECSP generalizes the well-known Steiner 2-edge connected subgraph problem. In this paper we study the convex hull of the incidence vectors corresponding to feasible solutions of 2ECSP. First, a natural integer programming formulation is given and it is shown that its linear relaxation is not sufficient to describe the polytope associated with 2ECSP even when G is series-parallel. Then, we introduce two families of new valid inequalities and we give sufficient conditions for them to be facet-defining. Later, we concentrate on the separation problem. We find polynomial time algorithms to solve the separation of important subclasses of the introduced inequalities, concluding that the separation of the new inequalities, when G is series-parallel, is polynomially solvable.     

Achievable sets, brambles, and sparse treewidth obstructions

One consequence of the graph minor theorem is that for every k there exists a finite obstruction set Obs(TW?k). However, relatively little is known about these sets, and very few general obstructions are known. The ones that are known are the cliques, and graphs which are formed by removing a few edges from a clique. This paper gives several general constructions of minimal forbidden minors which are sparse in the sense that the ratio of the treewidth to the number of vertices n does not approach 1 as n approaches infinity. We accomplish this by a novel combination of using brambles to provide lower bounds and achievable sets to demonstrate upper bounds. Additionally, we determine the exact treewidth of other basic graph constructions which are not minimal forbidden minors.     

Sizes of Critical Graphs with Small Maximum Degrees

In this paper, we give new lower bounds for the size of Δ-critical graphs with Δ=8,9 which improve the partial results of Luo [6] and Y. Zhao [12].     

Network externalities in a dynamic monopoly

We reconsider the role of network externalities in a dynamic spatial monopoly where the firm must invest in order to accumulate capacity, while consumers may have either linear or quadratic preferences. We (1) characterise saddle point equilibria, (2) prove that the extent of market coverage is increasing in the network effect and (3) unlike the existing static literature on the same problem, the monopolist may not make introductory price offers. Then, we briefly deal with the socially optimal solution, showing that, in general, a planner would serve more consumers than a profit-seeking monopolist.